package BST;

public class Node {
	
	private Integer value = -1;
	private Node left;
	private Node right;
	
	public Node(){}
	
	public void setLeft(Node left){
		this.left = left;
	}
	
	public Node getLeft(){
		return this.left;
	}
	
	public void setRight(Node right){
		this.right = right;
	}
	
	public Node getRight(){
		return this.right;
	}
	
	public void setValue(int value){		
		this.value = value;
		if(this.value != 0){
			this.left = new Node();
			this.right = new Node();
		}	
	}
	
	public int getValue(){
		return this.value;
	}	
}
